The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(minus(x)) → x
minus(+(x, y)) → *(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*(x, y)) → +(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
minus(+(x, y)) →⁺ *(minus(minus(minus(x))), minus(minus(minus(y))))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0,0].
The pumping substitution is [x / +(x, y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)